Proof Theory, Modal Logic and Reflection Principles
نویسنده
چکیده
Sergei Artemov Reflection vs. co-Reflection in Intuitionistic Epistemic Logic. This is joint work with Tudor Protopopescu. We outline an intuitionistic view of knowledge which maintains the Brouwer-Heyting-Kolmogorov semantics and is consistent with Williamson’s suggestion that intuitionistic knowledge is the result of verification. On this view, co-Reflection F → KF is valid since it encodes a fundamental property that intuitionistic truth is constructive and hence checkable. On the other hand, reflection KF → F demands that all verifications yield strict proofs which is not consistent with verification practice and hence is not among the basic principles of intuitionistic epistemic logic. Consequently we show that reflection of knowledge is a distinctly classical principle, too strong as the intuitionistic truth condition for knowledge, “false is not known,” which can be more adequately expressed by e.g., ∼(KF&∼F ), or, equivalently, ∼K⊥. We construct a system of intuitionistic epistemic logic IEL = IPC +K(F → G)→ (KF → KG) + F → KF +∼K⊥ and provide its provability/verification semantics by extending the well-known Gödel’s embedding. We also show that IEL enjoys a natural and explanatory Kripke-style semantics. Lev Beklemishev Positive modal logic and reflection principles
منابع مشابه
Strictly Positive Fragments of Modal and Description Logic
In this talk we will advocate the use of weak systems of modal logic called strictly positive. These can be seen as fragments of polymodal logic consisting of implications of the form A → B, where A and B are formulas built-up from T (truth) and the variables using just conjunction and the diamond modalities. The interest towards such fragments independently emerged around 2010 in two different...
متن کاملKripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in arithmetic [9, 5, 8]. This system plays an important role in some recent applications of provability algebras in proof theory [2, 3]. However, an obstacle in the study of GLP is that it is incomplete w.r.t. any class ...
متن کاملCalibrating Provability Logic: From Modal Logic to Reflection Calculus
Several interesting applications of provability logic in proof theory made use of a polymodal logic GLP due to Giorgi Japaridze. This system, although decidable, is not very easy to handle. In particular, it is not Kripke complete. It is complete w.r.t. neighborhood semantics, however this could only be established recently by rather complicated techniques [1]. In this talk we will advocate the...
متن کاملSuhrawardi's Modal Syllogisms
Suhrawardi’s logic of the Hikmat al-Ishraq is basically modal. So to understand his modal logic one first has to know the non-modal part upon which his modal logic is built. In my previous paper ‘Suhrawardi on Syllogisms’(3) I discussed the former in detail. The present paper is an exposition of his treatment of modal syllogisms. On the basis of some reasonable existential presuppositi...
متن کاملConstructive Provability Logic
We present constructive provability logic, an intuitionstic modal logic that validates the Löb rule of Gödel and Löb’s provability logic by permitting logical reflection over provability. Two distinct variants of this logic, CPL and CPL*, are presented in natural deduction and sequent calculus forms which are then shown to be equivalent. In addition, we discuss the use of constructive provabili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014